A Recursive Formulation for Repeated Agency with History Dependence

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Recursive Formulation for Repeated Agency with History Dependence

There is now an extensive literature regarding the efficient design of incentive mechanisms in dynamic environments. Included in this literature are models with privately observed endowment shocks (Green [6], Thomas and Worrall [13], Phelan [9], Wang [15], among others), privately observed taste shocks (Atkeson and Lucas [2]) and privately observed effort levels (Spear and Srivastava [11], Phel...

متن کامل

A New Recursive Formulation for the Mixed Redundancy Strategy in Reliability Optimization Problems

One of the common approaches for improving the reliability of a specific system is to use parallel redundant components in subsystems. This approach, which is known as the redundancy allocation problem (RAP), includes the simultaneous selection of the component type and its level for each subsystem in order to maximize the system reliability.Traditionally, there are two redundancy strategies, n...

متن کامل

Recursive Repeated Games with Absorbing States

We show the existence of stationary limiting average "-equilibria (" > 0) for two-person recursive repeated games with absorbing states. These are stochastic games where all states but one are absorbing, and in the non-absorbing state all payoos are equal to zero. A state is called absorbing, if the probability of a transition to any other state is zero for all available pairs of actions. For t...

متن کامل

Dependence Analysis for Recursive Data

This paper describes a general and powerful method for dependence analysis in the presence of recursive data constructions. The particular analysis presented is for identifying partially dead recursive data, but the general framework for representing and manipulating recursive substruc-tures applies to all dependence analyses. The method uses projections based on general regular tree grammars e...

متن کامل

Quantum walks with history dependence

We introduce a multi-coin discrete quantum walk where the amplitude for a coin flip depends upon previous tosses. Although the corresponding classical random walk is unbiased, a bias can be introduced into the quantum walk by varying the history dependence. By mixing the biased walk with an unbiased one, the direction of the bias can be reversed leading to a new quantum version of Parrondo’s pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Economic Theory

سال: 2000

ISSN: 0022-0531

DOI: 10.1006/jeth.1999.2619